k-Anonymous Patterns
نویسندگان
چکیده
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. In this paper we show that this belief is ill-founded. By shifting the concept of k-anonymity from data to patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery, and provide a methodology to efficiently and effectively identify all possible such threats that might arise from the disclosure of a set of extracted patterns.
منابع مشابه
Anonymous Biometric Access Control
Access control systems using the latest biometric technologies can offer a higher level of security than conventional passwordbased systems. Their widespread deployments, however, can severely undermine individuals’ rights of privacy. Biometric signals are immutable and can be exploited to associate individuals’ identities to sensitive personal records across disparate databases. In this paper,...
متن کاملمقایسه نیمرخ شخصیتی معتادان گمنام و غیر گمنام زندانی مرد
Aim: This study compared the personality profiles of inmate anonymous and non-anonymous male addicts. Method: The participants of study were anonymous and non-anonymous male addicts of the prisons of the Hamadan province in 1391. The population was 3130 addicts, including 627 anonymous and 2503 non-anonymous addicts. The 310 addicts were selected by stratified random sampling the sample size wa...
متن کاملFraudMiner: A Novel Credit Card Fraud Detection Model Based on Frequent Itemset Mining
This paper proposes an intelligent credit card fraud detection model for detecting fraud from highly imbalanced and anonymous credit card transaction datasets. The class imbalance problem is handled by finding legal as well as fraud transaction patterns for each customer by using frequent itemset mining. A matching algorithm is also proposed to find to which pattern (legal or fraud) the incomin...
متن کاملErratum to: Linear spaces and transversal designs: $$k$$ -anonymous combinatorial configurations for anonymous database search
Anonymous database search protocols allow users to query a database anonymously. This can be achieved by letting the users form a peerto-peer community and post queries on behalf of each other. In this article we discuss an application of combinatorial configurations (also known as regular and uniform partial linear spaces) to a protocol for anonymous database search, as defining the key-distri...
متن کاملLinear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search
Anonymous database search protocols allow users to query a database anonymously. This can be achieved by letting the users form a peerto-peer community and post queries on behalf of each other. In this article we discuss an application of combinatorial configurations (also known as regular and uniform partial linear spaces) to a protocol for anonymous database search, as defining the key-distri...
متن کامل